Technical Note—Distribution of the Mean Queue Size for the Time-Dependent Queue
نویسندگان
چکیده
منابع مشابه
Approximations for the mean sojourn time in a parallel queue
This paper considers a parallel queue, which is two-queue network, where any arrival generates a job at both queues. The focus is on methods to quantify the mean value of the `system's sojourn time' S: with Si denoting a job's sojourn time in queue i, S is defined as max(S1; S2). It is noted that earlier work has revealed that this class of models is notoriously hard to analyze. We first evalua...
متن کاملApproximations for the mean sojourn time in a parallel queue
This paper considers a parallel queue, which is two-queue network, where any arrival generates a job at both queues. The focus is on methods to quantify the mean value of the `system's sojourn time' S: with Si denoting a job's sojourn time in queue i, S is defined as max(S1; S2). It is noted that earlier work has revealed that this class of models is notoriously hard to analyze. We first evalua...
متن کاملApproximations for the mean sojourn time in a parallel queue
This paper considers a parallel queue, which is two-queue network, where any arrival generates a job at both queues. The focus is on methods to quantify the mean value of the `system's sojourn time' S: with Si denoting a job's sojourn time in queue i, S is defined as max(S1; S2). It is noted that earlier work has revealed that this class of models is notoriously hard to analyze. We first evalua...
متن کاملApproximations for the mean sojourn time in a parallel queue
This paper considers a parallel queue, which is two-queue network, where any arrival generates a job at both queues. The focus is on methods to quantify the mean value of the `system's sojourn time' S: with Si denoting a job's sojourn time in queue i, S is defined as max(S1; S2). It is noted that earlier work has revealed that this class of models is notoriously hard to analyze. We first evalua...
متن کاملApproximations for the mean sojourn time in a parallel queue
This paper considers a parallel queue, which is two-queue network, where any arrival generates a job at both queues. The focus is on methods to quantify the mean value of the `system's sojourn time' S: with Si denoting a job's sojourn time in queue i, S is defined as max(S1; S2). It is noted that earlier work has revealed that this class of models is notoriously hard to analyze. We first evalua...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 1973
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.21.2.636